Exploiting Schelling behavior for improving data accessibility in mobile peer-to-peer networks
نویسندگان
چکیده
In 1969, Thomas Schelling proposed one of the most cited models in economics to explain how similar people (e.g. people with the same race, education, community) group together in American neighborhoods. Interestingly, we observe that the analogies of this model indeed exist in numerous scenarios where co-located people communicate via their personal wireless devices in Peer-to-Peer (P2P) fashion. Schelling’s model therefore can potentially serve as a mobility model and offer a unique opportunity to efficiently disseminate messages in mobile P2P networks. In this paper, we exploit the natural grouping and moving behavior of humans presented by Schelling to expedite data dissemination in such networks. Particularly, we design a push model for dense network areas to maximize data dissemination and a pull model for sparse network areas to utilize network bandwidth and node energy efficiently. We ensure that our scheme is lightweight since queries and responses are automatically limited within groups of mobile nodes carried by similar people. Moreover, we avoid broadcast storms by assigning each message a broadcast timer and applying overhearing mechanism to reduce redundant transmissions. Finally, our simulation results show that the proposed data dissemination scheme improves the query hit ratio significantly while utilizing network bandwidth efficiently.
منابع مشابه
A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Genetic Programming-based trust model for P2P Networks
Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملTrust and Reputation in Peer-to-peer Networks a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
The increasing availability of high bandwidth Internet connections and low-cost, commodity computers in people’s homes has stimulated the use of resource sharing peerto-peer networks. These systems employ scalable mechanisms that allow anyone to offer content and services to other system users. However, the open accessibility of these systems make them vulnerable to malicious users wishing to p...
متن کاملCLEAR: An Efficient Context and Location-Based Dynamic Replication Scheme for Mobile-P2P Networks
We propose CLEAR (Context and Location-based Efficient Allocation of Replicas), a dynamic replica allocation scheme for improving data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. CLEAR exploits user mobility patterns and deploys a super-peer architecture to manage replica allocation efficiently. CLEAR avoids broadcast storm during replica allocation and eliminates the need for ...
متن کامل